Transformations on Graphs and Convexity
نویسنده
چکیده
A bstract . Graph transformations tha.t ma.y be reduced to the form x(l +l) = x(I)+vu(Ax(I)), with x(I),x(I+1 ) E R , u convex function and A symmet ric mat rix, are studied. In par t icular , a reduction to t he class is exhibited for some graph t ransformations recentl y introduced by Odlyzko and Randall. Fur ther result s on periods, quasi-periods, and pre-periods are presented. A class of multi-threshold t ransformations is introduced.
منابع مشابه
On local convexity in graphs
A set K of nodes of a graph G is geodesically convex (respectively, monophonically convex) if K contains every node on every shortest (respectively, chordless) path joining nodes in K. We investigate the classes of graphs which are characterized by certain local convexity conditions with respect to geodesic convexity, in particular, those graphs in which balls around nodes are convex, and those...
متن کاملGeodesic Convexity and Cartesian Products in Graphs
In this work we investigate the behavior of various geodesic convexity parameters with respect to the Cartesian product operation for graphs. First, we show that the convex sets arising from geodesic convexity in a Cartesian product of graphs are exactly the same as the convex sets arising from the usual binary operation ⊕ for making a convexity space out of the Cartesian product of any two con...
متن کاملThe convexity of induced paths of order three
In this paper, we introduce a new convexity on graphs similar to the well known P3convexity [3], which we will call P ∗ 3 -convexity. We show that several P ∗ 3 -convexity parameters (hull number, convexity number, Carathéodory number, Radon number, interval number and percolation time) are NP-hard even on bipartite graphs. We show a strong relation between this convexity and the well known geo...
متن کاملOn triangle path convexity in graphs
Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved
متن کاملConvexity and HHD-Free Graphs
It is well known that chordal graphs can be characterized via m-convexity. In this paper we introduce the notion of m-convexity (a relaxation of m-convexity) which is closely related to semisimplicial orderings of graphs. We present new characterizations of HHD-free graphs via m -convexity and obtain some results known from [B. Jamison and S. Olariu, Adv. Appl. Math., 9 (1988), pp. 364–376] as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 1 شماره
صفحات -
تاریخ انتشار 1987